(Non)-Approximability for the Multi-criteria TSP(1, 2)
نویسندگان
چکیده
The approximability of multi-criteria combinatorial problems motivated a lot of articles. However, the non-approximability of this problems has never been investigated up to our knowledge. We propose a way to get some results of this kind which works for several problems and we put it into practice on a multi-criteria version of the traveling salesman problem with distances one and two (TSP (1, 2)). Following the article of Angel et al. (FCT 2003) who presented an approximation algorithm for the bi-criteria TSP (1, 2), we extend and improve the result to any number k of criteria.
منابع مشابه
A On Approximating Multi-Criteria TSP
We present approximation algorithms for almost all variants of the multi-criteria traveling salesman problem (TSP). First, we devise randomized approximation algorithms for multi-criteria maximum traveling salesman problems (Max-TSP). For multi-criteria Max-STSP, where the edge weights have to be symmetric, we devise an algorithm with an approximation ratio of 2/3 − ε. For multi-criteria Max-AT...
متن کاملMulti-Criteria Traveling Salesman Problems
In multi-criteria optimization problems, several objective functions have to be optimized. Since the different objective functions are usually in conflict with each other, one cannot consider only one particular solution as the optimal solution. Instead, the aim is to compute a so-called Pareto curve of solutions. Since Pareto curves cannot be computed efficiently in general, we have to be cont...
متن کامل1 2 O ct 2 00 6 Approximation Algorithms for Multi - criteria Traveling Salesman Problems ∗
In multi-criteria optimization problems, several objective functions have to be optimized. Since the different objective functions are usually in conflict with each other, one cannot consider only one particular solution as the optimal solution. Instead, the aim is to compute a so-called Pareto curve of solutions. Since Pareto curves cannot be computed efficiently in general, we have to be cont...
متن کاملDeterministic algorithms for multi-criteria Max-TSP
We present deterministic approximation algorithms for the multi-criteria maximum traveling salesman problem (Max-TSP). Our algorithms are faster and simpler than the existing randomized algorithms. We devise algorithms for the symmetric and asymmetric multi-criteria Max-TSP that achieve ratios of 1/2k−ε and 1/(4k−2)−ε, respectively, where k is the number of objective functions. For two objectiv...
متن کاملApproximability of the Multiple Stack TSP
STSP seeks a pair of pickup and delivery tours in two distinct networks, where the two tours are related by LIFO contraints. We address here the problem approximability. We notably establish that asymmetric MaxSTSP and MinSTSP12 are APX, and propose a heuristic that yields to a 1/2, 3/4 and 3/2 standard approximation for respectively Max2STSP, Max2STSP12 and Min2STSP12.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005